Fast and convergence-guaranteed algorithm for linear separation
نویسندگان
چکیده
منابع مشابه
Exact Fast Algorithm For Optimal Linear Separation Of 2D Distribution
The paper presents a new fast computation scheme for linear separation in two-dimensional feature space. This scheme is based on a combination of several image processing techniques: fast Hough transform, cumulative sum computation and expression of optimized criterion as a function of additive statistics. It is shown that complexity of the scheme is O(n log n) for chosen set of criteria. Two a...
متن کاملBlind source separation for speech based on fast-convergence algorithm with ICA and beamforming
We propose a new algorithm for blind source separation (BSS), in which independent component analysis (ICA) and beamforming are combined to resolve the low-convergence problem through optimization in ICA. The proposed method consists of the following three parts: (1) frequency-domain ICA with direction-of-arrival (DOA) estimation, (2) null beamforming based on the estimated DOA, and (3) integra...
متن کاملEfficient Algorithm for Linear Pattern Separation
We propose cutting plane algorithm for solving the linear pattern separation problem, which is a particular case of the more general topic of data mining. The solution we provided can also be applied to any other pattern separation scheme based on a convex discriminant like linear piecewise or quadratic models. The method consist in minimizing the total sum of misclassification gaps, which is a...
متن کاملBlind Source Separation Based on Fast-convergence Algorithm Using Ica and Array Signal Processing
ABSTRACT We propose a new algorithm for blind source separation (BSS), in which independent component analysis (ICA) and beamforming are combined to resolve the low-convergence problem through optimization in ICA. The proposed method consists of the following three parts: (1) frequency-domain ICA with direction-of-arrival (DOA) estimation, (2) null beamforming based on the estimated DOA, and (3...
متن کاملA Fast Simplex Algorithm for Linear Programming
Recently, computational results demonstrated remarkable superiority of a so-called “largest-distance” rule and “nested pricing” rule to other major rules commonly used in practice, such as Dantzig’s original rule, the steepest-edge rule and Devex rule. Our computational experiments show that the simplex algorithm using a combination of these rules turned out to be even more efficient. Mathemati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2010
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-010-0037-5